Speci cation and Veri cation of Compiler Frontend Tasks :
نویسندگان
چکیده
We describe a methodology for the speciication and veriication of the tasks of compiler fron-tends. The semantics of the language to be compiled is speciied with Evolving Algebras. With respect to the semantics of the language we deene the static semantics. The semantical analysis checks whether a program satisses the static semantics. We introduce a notion of correctness of semantic analysis and show how it can be proven. The technique will be demonstrated for a subset of real life imperative programming languages.
منابع مشابه
Of What Use is a Veri ed Compiler Speci cation ?
Program veri cation is normally performed on source code. However, it is the object code which is executed and so which ultimately must be correct. The compiler used to produce the object code must not introduce bugs. The majority of the compiler correctness literature is concerned with the veri cation of compiler speci cations rather than executable implementations. We discuss di erent ways th...
متن کاملStatic Analysis and Veri cation of Aerospace Software by Abstract Interpretation (Abstract)
The validation of software checks informally (e.g., by code reviews or tests) the conformance of the software executions to a speci cation. More rigorously, the veri cation of software proves formally the conformance of the software semantics (that is, the set of all possible executions in all possible environments) to a speci cation. It is of course di cult to design a sound semantics, to get ...
متن کاملAn Architecture for Veri ed
machine term rewriting graph rewriting traversal techniques . . . prefabricated parts generated from specifications Compiler executes Figure3. Implementation architecture 4.3 An Initial Correct Compiler The discussion in the previous subsection relies on the availability of a correct compiler for the implementation language. This problem must be dealt with in order to continue. The aim of this ...
متن کاملDesign Compiler SYNOPSYS VANTAGE VHDL
We present a solution to the veri cation problem of high-level synthesis. The high-level synthesis system CALLAS takes as input an algorithmic speci cation, in VHDL, and produces as output an EDIF netlist. Both, the speci cation and the generated netlist can be interpreted as nite state machine descriptions. Then, in this context, the veri cation problem is reduced to proving the behavioral equ...
متن کاملA Veriied Vista Implementation Final Report
Specification Implementation Refine Algorithm Figure 1.3: The Re nement Hierarchy concerns whether the algorithm is correct with respect to the abstract speci cation, that is, whether the semantics of a source program is preserved in the code that the algorithm speci es should be produced. By far the majority of compiler correctness work described in the literature is concerned with this form o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996